Numerical Methods for Eigenvalue Distributions of Random Matrices
نویسنده
چکیده
We present efficient numerical techniques for calculation of eigenvalue distributions of random matrices in the beta-ensembles. We compute histograms using direct simulations on very large matrices, by using tridiagonal matrices with appropriate simplifications. The distributions are also obtained by numerical solution of the Painlevé II and V equations with high accuracy. For the spacings we show a technique based on the Prolate matrix and Richardson extrapolation, and we compare the distributions with the zeros of the Riemann zeta function. 1 Largest Eigenvalue Distributions In this section, the distributions of the largest eigenvalue of matrices in the β-ensembles are studied. Histograms are created first by simulation, then by solving the Painlevé II nonlinear differential equation. 1.1 Simulation The Gaussian Unitary Ensemble (GUE) is defined as the Hermitian n × n matrices A, where the diagonal elements xjj and the upper triangular elements xjk = ujk + ivjk are independent Gaussians with zero-mean, and
منابع مشابه
18.338J/16.394J: The Mathematics of Infinite Random Matrices Numerical Methods in Random Matrices
In this section, the distributions of the largest eigenvalue of matrices in the β-ensembles are studied. His-tograms are created first by simulation, then by solving the Painlevé II nonlinear differential equation.
متن کاملEigenvalue Distributions of Large Hermitian Matrices; Wigner’s Semi-circle Law and a Theorem of Kac, Murdock, and Szegij
Wigner’s semi-circle law describes the eigenvalue distribution of certain large random Hermitian matrices. A new proof is given for the case of Gaussian matrices, that involves reducing a random matrix to tridiagonal form by a method that is well known as a technique for numerical computation of eigenvalues. The result is a generalized Toeplitz matrix whose eigenvalue distribution can be found ...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملComparative Study of Random Matrices Capability in Uncertainty Detection of Pier’s Dynamics
Because of random nature of many dependent variables in coastal engineering, treatment of effective parameters is generally associated with uncertainty. Numerical models are often used for dynamic analysis of complex structures, including mechanical systems. Furthermore, deterministic models are not sufficient for exact anticipation of structure’s dynamic response, but probabilistic models...
متن کاملEigenvalue spectra of random matrices for neural networks.
The dynamics of neural networks is influenced strongly by the spectrum of eigenvalues of the matrix describing their synaptic connectivity. In large networks, elements of the synaptic connectivity matrix can be chosen randomly from appropriate distributions, making results from random matrix theory highly relevant. Unfortunately, classic results on the eigenvalue spectra of random matrices do n...
متن کامل